منابع مشابه
Eigenvalues of a Linear Transformation
We adopt the following convention: i, j, m, n denote natural numbers, K denotes a field, and a denotes an element of K. Next we state several propositions: (1) Let A, B be matrices over K, n1 be an element of Nn, and m1 be an element of Nm. If rng n1 × rngm1 ⊆ the indices of A, then Segm(A + B,n1,m1) = Segm(A,n1,m1) + Segm(B,n1,m1). (2) For every without zero finite subset P of N such that P ⊆ ...
متن کاملRhotrix Multiplication on Two-Dimensional Process Grid Topologies
This paper presents rhotrix multiplication and introduces its implementation on process grid topologies. Covered in this work, are reviews of generalization cases of n-dimensional rhotrix multiplication. A parallel program based on MPI master-worker paradigm is implemented. By means of analyzing the time complexity and memory requirement for the method, the authors provided insight into how to ...
متن کاملGeneralization of Heart-Oriented Rhotrix Multiplication and its Algorithm Implementation
ABSTRACT This paper introduces a novel generalized concept of higher order heart-oriented rhotrix multiplication expression. The multiplication method we adapted is intended to maintain the unique properties associated with the initial definition of rhotrix. The special multiplication process can be used to solve various problems involving n x n rhotrices multiplication. Most importantly a gene...
متن کاملLinear transformation of Hidden Markov Models based on linear regression
This paper treats a linear transformation of word templates in a word recognition system. The object of the transformation, called LMR-transform, is to adapt the recogniser to a new acoustical environment. The transform is derived by linear regression on pairs of word utterances from two different acoustical environments. The use of the transform has been evaluated for recognition accuracy, spe...
متن کاملMatching Terrains under a Linear Transformation∗
We study the problem of matching two polyhedral terrains, where one can be changed vertically by a linear transformation of the third coordinate (scaling and translation). We give an algorithm that minimizes the maximum distance over all linear transformations in O(npolylog n) expected time. We also study matching two 1-dimensional terrains, and give a (1+ ε)-approximation algorithm for minimiz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Linear Algebra & Matrix Theory
سال: 2012
ISSN: 2165-333X,2165-3348
DOI: 10.4236/alamt.2012.24007